DCEL: A Polyhedral Database and Programming Environment
نویسنده
چکیده
In this paper we describe the DCEL system: a geometric software package which implements a polyhedral programming environment. This package enables fast proto-typing of geometric algorithms for polyhedra or for polyhedral surfaces. We provide an overview of the system's functionality and demonstrate its use in several applications.
منابع مشابه
Designing and Implementing a General Purpose Halfedge Data Structure
Halfedge data structures (HDS) are fundamental in representing combinatorial geometric structures, useful for representing any planar structures such as plane graphs and planar maps, polyhedral surfaces and boundary representations (BREPs), two-dimensional views of a three dimensional scene, etc. Many variants have been proposed in the literature, starting with the winged-edge data structure of...
متن کاملFGP approach to multi objective quadratic fractional programming problem
Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objecti...
متن کاملBranched Polyhedral Systems
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other polyhedra. The framework, for instance, simultaneously generalizes extended formulations like the well-known ones (see Balas [1]) for the convex hulls of unions of polyhedra (disjunctive programming) and like those obt...
متن کاملپیدا کردن یک نقطه درونی نسبی یک چند‌وجهی با استفاده از برنامه‌ریزی خطی: کاربرد در برنامه‌ریزی هندسی
One of the fundamental concepts in convex analysis and optimization is the relative interior of a set. This concept is used when the interior of a set is empty due to the incompleteness of its dimension. In this paper, first, we propose a linear programming model to find a relative interior point of a polyhedral set. Then, we discuss the application of this model to geometric programming. Speci...
متن کاملPolyhedral object recognition by indexing
In computer vision, the indexing problem is the problem of recognizing a few objects in a large database of objects while avoiding the help of the classical image-feature-to-object-feature matching paradigm. In this paper we address the problem of recognizing 3-D polyhedral objects from 2-D images by indexing. Both the objects to be recognized and the images are represented by weighted graphs. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 8 شماره
صفحات -
تاریخ انتشار 1998